Stability of Semi-Lagrangian schemes of arbitrary odd degree under constant and variable advection speed
نویسندگان
چکیده
منابع مشابه
Global semi-Lagrangian advection
In the recent years, many international centers for numerical weather prediction and climate modeling have adopted in their operational codes a semiLagrangian scheme for transport. This numerical technique became very popular due to its stability and accuracy properties. The time step is only restricted by accuracy and not by a CFL stability condition. In a joint effort with CPTEC/INPE (the Bra...
متن کاملparticle - mesh semi - Lagrangian advection scheme
We describe the remapped particle-mesh method, a new mass-conserving method for solving the density equation which is suitable for combining with semi-Lagrangian methods for compressible flow applied to numerical weather prediction. In addition to the conservation property, the remapped particle-mesh method is computationally efficient and at least as accurate as current semi-Lagrangian methods...
متن کاملParallel Algorithms for Semi-Lagrangian Advection
Numerical time-step limitations associated with the explicit treatment of advection-dominated problems in computational uid dynamics are often relaxed by employing Eulerian-Lagrangian methods. These are also known as semi-Lagrangian methods in the atmospheric sciences. Such methods involve backward time integration of a characteristic equation to nd the departure point of a uid particle arrivin...
متن کاملSolving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes
In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...
متن کاملLearning Read-constant Polynomials of Constant Degree over Arbitrary Moduli
Boolean functions that have constant-degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2019
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3494